Duality in mathematical programming of set functions: On Fenchel duality theorem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Legendre-Fenchel duality in elasticity

We show that the displacement and strain formulations of the displacement-traction problem of three-dimensional linearized elasticity can be viewed as Legendre-Fenchel dual problems to the stress formulation of the same problem. We also show that each corresponding Lagrangian has a saddle-point, thus fully justifying this new approach to elasticity by means of Legendre-Fenchel duality. Résumé D...

متن کامل

Value Regularization and Fenchel Duality

Regularization is an approach to function learning that balances fit and smoothness. In practice, we search for a function f with a finite representation f = ∑i ciφi(·). In most treatments, the ci are the primary objects of study. We consider value regularization, constructing optimization problems in which the predicted values at the training points are the primary variables, and therefore the...

متن کامل

Approximate Fenchel-Lagrangian Duality for Constrained Set-Valued Optimization Problems

In this article, we construct a Fenchel-Lagrangian ε-dual problem for set-valued optimization problems by using the perturbation methods. Some relationships between the solutions of the primal and the dual problems are discussed. Moreover, an ε-saddle point theorem is proved.

متن کامل

Convex Repeated Games and Fenchel Duality

We describe and analyze an algorithmic framework for playing convex repeatedgames. In each trial of the repeated game, the first player predicts a vector andthen the second player responds with a loss function over the vector. Based on ageneralization of Fenchel duality, we derive an algorithmic framework for the firstplayer and analyze the player’s regret. We then use our a...

متن کامل

Fenchel-type duality for matroid valuations

The weighted matroid intersection problem has recently been extended to the valuated matroid intersection problem: Given a pair of valuated matroids Mi = (V,Bi, ωi) (i = 1, 2) defined on a common ground set V , find a common base B ∈ B1∩B2 that maximizes ω1(B)+ω2(B). This paper develops a Fenchel-type duality theory related to this problem with a view to establishing a convexity framework for n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1983

ISSN: 0022-247X

DOI: 10.1016/0022-247x(83)90145-2